- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources4
- Resource Type
-
0013000000000000
- More
- Availability
-
31
- Author / Contributor
- Filter by Author / Creator
-
-
Ghosal, Riddhi (4)
-
Sahai, Amit (3)
-
Jain, Aayush (2)
-
Ghoshal, Ashrujit (1)
-
Hair, Isaac M (1)
-
Jaeger, Joseph (1)
-
Lou, Paul (1)
-
Tessaro, Stefano (1)
-
Vafa, Neekon (1)
-
Waters, Brent (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
& Adams, S.G. (0)
-
& Ahmed, K. (0)
-
& Ahmed, Khadija. (0)
-
& Aina, D.K. Jr. (0)
-
& Akcil-Okan, O. (0)
-
- Filter by Editor
-
-
Bansal, Nikhil (1)
-
Dunkelman, Orr (1)
-
Dziembowski, Stefan (1)
-
Koucký, Michal (1)
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Koucký, Michal; Bansal, Nikhil (Ed.)We give a public key encryption scheme that is provably secure against poly-size adversaries, assuming nlogαn hardness of the standard planted clique conjecture, for any α ∈ (0,1), and a relatively mild hardness conjecture about noisy k-LIN over expanders that is not known to imply public-key encryption on its own. Both of our conjectures correspond to natural average-case variants of NP-complete problems and have been studied for multiple decades, with unconditional lower bounds supporting them in a variety of restricted models of computation. Our encryption scheme answers an open question in a seminal work by Applebaum, Barak, and Wigderson [STOC’10].more » « lessFree, publicly-accessible full text available June 15, 2026
-
Ghosal, Riddhi; Jain, Aayush; Lou, Paul; Sahai, Amit; Vafa, Neekon (, Springer Nature Switzerland)
-
Ghosal, Riddhi; Sahai, Amit; Waters, Brent (, PKC 2023)
-
Ghoshal, Ashrujit; Ghosal, Riddhi; Jaeger, Joseph; Tessaro, Stefano (, Advances in Cryptology - EUROCRYPT 2022)Dunkelman, Orr; Dziembowski, Stefan (Ed.)
An official website of the United States government
